Predecessor problem on smooth distributions
نویسنده
چکیده
We follow a research thread studying the predecessor problem on “smooth” distribution families. We propose a conceptually simpler solution utilizing wellknown results from much better studied variant of the problem that assumes nothing about the input. As a side effect, we are able to extend the range of handled input distributions for the most studied case needing expected O (log log n) time, and we provide better insight into why the related methods are faster on smooth inputs.
منابع مشابه
Random input helps searching predecessors
We solve the dynamic Predecessor Problem with high probability (whp) in constant time, using only n bits of memory, for any constant δ > 0. The input keys are random wrt a wider class of the well studied and practically important class of (f1, f2)-smooth distributions introduced in [3]. It achieves O(1) whp amortized time. Its worst-case time is O( √ logn log logn ). Also, we prove whp O(log lo...
متن کاملA pr 2 01 1 Random input helps searching predecessors
We solve the dynamic Predecessor Problem with high probability (whp) in constant time, using only n bits of memory, for any constant δ > 0. The input keys are random wrt a wider class of the well studied and practically important class of (f1, f2)-smooth distributions introduced in [3]. It achieves O(1) whp amortized time. Its worst-case time is O( √ logn log logn ). Also, we prove whp O(log lo...
متن کاملPredecessor Queries in Dynamic Integer Sets
We consider the problem of maintaining a set of n integers in the range 0::2 w ? 1 under the operations of insertion, deletion, predecessor queries, minimum queries and maximum queries on a unit cost RAM with word size w bits. Let f (n) be an arbitrary nondecreasing smooth function satisfying log log n f (n) p log n. A data structure is presented supporting insertions and deletions in worst cas...
متن کامل2 Survey of Predecessor Lower Bound Results 2.1 the Problem 2.2 Results
Overview In the last two lectures, we discussed several data structures for solving predecessor and succes sor queries in the word RAM model: van Emde Boas trees, y-fast trees, and fusion trees. This establishes an upper bound on the predecessor problem. In this lecture we discuss lower bounds on the cell-probe complexity of the static predecessor problem with constrained space. In particular,...
متن کاملAnalyses and Algorithms for Predecessor and Control Problems for Boolean Networks of Bounded Indegree
We study the predecessor and control problems for Boolean networks (BNs). The predecessor problem is to determine whether there exists a global state that transits to a given global state in a given BN, and the control problem is to find a sequence of 0-1 vectors for control nodes in a given BN which leads the BN to a desired global state. The predecessor problem is useful both for the control ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015